Isla: Integrating Full-Scale ISA Semantics and Axiomatic Concurrency Models
نویسندگان
چکیده
Abstract Architecture specifications such as Armv8-A and RISC-V are the ultimate foundation for software verification correctness criteria hardware verification. They should define allowed sequential relaxed-memory concurrency behaviour of programs, but hitherto there has been no integration full-scale instruction-set architecture (ISA) semantics with axiomatic models, either in mathematics or tools. These ISA can be surprisingly large intricate, e.g. 100k+ lines Armv8-A. In this paper we present a tool, Isla, computing behaviours concurrent litmus tests respect to definitions, Sail, arbitrary Cat language. It is based on generic symbolic engine Sail specifications, which valuable also other tasks. We equip tool web interface make it widely accessible, illustrate evaluate RISC-V. By using authoritative semantics, lets one user instructions high confidence. Moreover, because these give detailed validated definitions aspects systems functionality, used by hypervisors operating systems, instruction fetch, exceptions, address translation, our provides basis developing these. demonstrate instruction-fetch model self-modifying code examples Simner et al.
منابع مشابه
Structured Axiomatic Semantics for UML Models
In this paper we provide a systematic formal interpretation for most elements of the UML notation. This interpretation, in a structured temporal logic, enables precise analysis of the properties of these models, and the verification of one model against another. We extend previous work by providing a structured logical interpretation for sequence diagrams, in which object communication is repre...
متن کاملFull abstraction of a denotational semantics for real - time concurrency
We present a fully abstract semantics for real-time distributed computing of the Ada and OCCAM kind in a denotational style. This semantics tums tennination, communication along channels, and the time communication takes place, into observabIes. Yet it is the coarsest semantics to do so which is syntax-directed (this is known as full abstraction). It extends the linear history semantics for CSP...
متن کاملOn the Axiomatic Treatment of Concurrency
T h i s p a p e r descr ibes a s e m a n t i c a l l y b a s e d ax iomat i c t r e a t m e n t of a s imple para l le l p r o g r a m m i n g l anguage . We consider an impera t ive l anguage w i t h sha red var iab le concurrency a n d a cr i t ical region cons t ruc t . After giving a s t r u c t u r a l ope ra t iona l semant ics for t h e l anguage we use t h e s eman t i c s t r u c t u r...
متن کاملIn Defence of Axiomatic Semantics
Many semantic theories implicitly attribute a foundational status to set theory, and set-theoretic characterisations of possible worlds in particular. The goal of a semantic theory is then to find a translation of the phenomena of interest into a settheoretic model. This can be contrasted with an axiomatic approach in which we can formulate “new” primitives and ontological categories, and devis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-81685-8_14